Hamiltonians on random walk trajectories

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hamiltonians on random walk trajectories

We consider Gibbs measures on the set of paths of nearest-neighbors random walks on Z+. The basic measure is the uniform measure on the set of paths of the simple random walk on Z+ and the Hamiltonian awards each visit to site x∈Z+ by an amount x ∈R, x∈Z+. We give conditions on ( x) that guarantee the existence of the (in nite volume) Gibbs measure. When comparing the measures in Z+ with the co...

متن کامل

Random walk on random walks

In this paper we study a random walk in a one-dimensional dynamic random environment consisting of a collection of independent particles performing simple symmetric random walks in a Poisson equilibrium with density ρ ∈ (0,∞). At each step the random walk performs a nearest-neighbour jump, moving to the right with probability p◦ when it is on a vacant site and probability p• when it is on an oc...

متن کامل

A Random Walk with Exponential Travel Times

Consider the random walk among N places with N(N - 1)/2 transports. We attach an exponential random variable Xij to each transport between places Pi and Pj and take these random variables mutually independent. If transports are possible or impossible independently with probability p and 1-p, respectively, then we give a lower bound for the distribution function of the smallest path at point log...

متن کامل

Random walk on disordered networks

Random walks are studied on disordered cellular networks in 2-and 3dimensional spaces with arbitrary curvature. The coefficients of the evolution equation are calculated in term of the structural properties of the cellular system. The effects of disorder and space-curvature on the diffusion phenomena are investigated. In disordered systems the mean square displacement displays an enhancement at...

متن کامل

Random Walk on Periodic Trees

Following Lyons (1990, [4]) we define a periodic tree, restate its branching number and consider a biased random walk on it. In the case of a transient walk, we describe the walk-invariant random periodic tree and calculate the asymptotic rate of escape (speed) of the walk. This is achieved by exploiting the connections between random walks and electric networks.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Stochastic Processes and their Applications

سال: 1998

ISSN: 0304-4149

DOI: 10.1016/s0304-4149(98)00052-0